Barbed Bisimulations for Timed Distributed π-calculus

Modelling distributed systems requires notions as locations, communication among the distributed processes, and resource access. To express time constraints for such systems, we have introduced timed distributed π-calculus called tDπ as an extension of the π-calculus with locations, types and timers. Timers define both timeouts for communication channels and timeouts for resources. We define the operational semantics of tDπ by using a reduction relation. We introduce and study several timed barbed bisimulations in the framework of tDπ. The bisimulations are compared with respect to their distinguishing power over timed located processes. The paper also emphasises the diversity of observational choices in tDπ (communication channel names, locations, types and timer values).